Axiomatization of Aristotelian Syllogistic Logic Based on Generalized Quantifier Theory
نویسندگان
چکیده
منابع مشابه
Directions in generalized quantifier theory
1. Introduction The study of generalized quantifiers is by now an old and respectable field of logic. With the pioneering work of Mostowski and Lindström in the fifties and sixties, quantifiers became a major tool in the model theory for logics extending first-order logic – many of these being representable as first-order logic with added quantifiers. Apart from general structure theorems on ho...
متن کاملtranslation of collocations from english into persian, based on ghazalas theory
غزالا همایندها را به صورت ترکیبی از دو یا چند واژه که همواره در متون مختلف زبان ها همراه با هم می آیند تعریف می نماید. از دیدگاه او روند رو به رشد میل به ترجمه ی همایندها در مطالعات ترجمه، به دلیل اهمیت آنها در انسجام ساختار زبان است. این پایان نامه اساسا به ترجمه ی همایندها منحصر شده است. هدف آن بررسی کاربرد راهکارهای غزالا در مورد ترجمه ی همایندها از انگلیسی به فارسی است. هدف دیگر آن یافتن پر...
15 صفحه اولOn a Decidable Generalized Quantifier Logic Corresponding to a Decidable Fragment of First-Order Logic
Van Lambalgen (1990) proposed a translation from a language containing a generalized quantifier Q into a first-order language enriched with a family of predicates Rs, for every arity i (or an infinitary predicate R) which takes Qz~(z, yl, . . . , y,~) to Vz(R(z, yl,..., g,~) --" ~b(x, Yl,..., Y,~)) (gl . . . . . g~ are precisely the free variables of Qzq~). The logic of Q (without ordinary quan...
متن کاملSyllogistic Logic with Complements
This paper continues the development of complete fragments of natural language by adding a noun-level complement operator to the basic syllogistic language of All X are Y and Some X are Y : in the fragment of this paper we can also say, for example, Some non-X are Y . We axiomatize this logic of this fragment in two ways: in a direct fashion, allowing the inference of an arbitrary sentence from...
متن کاملQuantifier Elimination-Based Constraint Logic Programming
We present an extension of constraint logic programming, where the admissible constraints are arbitrary first-order formulas over some domain. Constraint solving is realized by effective quantifier elimination. The current realization in our CLP(RL) system provides as possible domains R, C, and Qp for primes p. In R and C we admit arbitrary degrees in our constraints. In Qp we restrict to linea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Mathematics
سال: 2018
ISSN: 2328-5605
DOI: 10.11648/j.acm.20180703.23